computer notes - Data Structures - 24

Class No.24 Data Structures http://ecomputernotes.com

Huffman Encoding Huffman code is method for the compression for standard text documents. It makes use of a binary tree to develop codes of varying lengths for the letters used in the original message. Huffman code is also part of the JPEG image compression scheme. The algorithm was introduced by David Huffman in 1952 as part of a course assignment at MIT. http://ecomputernotes.com

Huffman Encoding To understand Huffman encoding, it is best to use a simple example. Encoding the 32-character phrase: " traversing threaded binary trees ", If we send the phrase as a message in a network using standard 8-bit ASCII codes, we would have to send 8*32= 256 bits. Using the Huffman algorithm, we can send the message with only 116 bits. http://ecomputernotes.com

Huffman Encoding List all the letters used, including the "space" character, along with the frequency with which they occur in the message. Consider each of these (character,frequency) pairs to be nodes; they are actually leaf nodes, as we will see. Pick the two nodes with the lowest frequency, and if there is a tie, pick randomly amongst those with equal frequencies. http://ecomputernotes.com

Huffman Encoding Make a new node out of these two, and make the two nodes its children. This new node is assigned the sum of the frequencies of its children. Continue the process of combining the two nodes of lowest frequency until only one node, the root, remains. http://ecomputernotes.com

Huffman Encoding Original text: traversing threaded binary trees size: 33 characters (space and newline) NL : 1 SP : 3 a : 3 b : 1 d : 2 e : 5 g : 1 h : 1 i : 2 n : 2 r : 5 s : 2 t : 3 v : 1 y : 1 http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 is equal to sum of the frequencies of the two children nodes. http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 There a number of ways to combine nodes. We have chosen just one such way. http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 2 http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 2 4 4 http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 2 5 4 4 4 6 http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 2 5 4 4 4 8 6 9 10 http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 2 5 4 4 4 8 6 14 9 19 10 http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 2 5 4 4 4 8 6 14 9 19 10 33 http://ecomputernotes.com

Huffman Encoding Start at the root. Assign 0 to left branch and 1 to the right branch. Repeat the process down the left and right subtrees. To get the code for a character, traverse the tree from the root to the character leaf node and read off the 0 and 1 along the path. http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 2 5 4 4 4 8 6 14 9 19 10 33 1 0 http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 2 5 4 4 4 8 6 14 9 19 10 33 1 0 1 0 1 0 http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 2 5 4 4 4 8 6 14 9 19 10 33 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 http://ecomputernotes.com

Huffman Encoding v 1 y 1 SP 3 r 5 h 1 e 5 g 1 b 1 NL 1 s 2 n 2 i 2 d 2 t 3 a 3 2 2 2 5 4 4 4 8 6 14 9 19 10 33 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 http://ecomputernotes.com

Huffman Encoding Huffman character codes NL  10000 SP  1111 a  000 b  10001 d  0100 e  101 g  10010 h  10011 i  0101 n  0110 r  110 s  0111 t  001 v  11100 y  11101 Notice that the code is variable length. Letters with higher frequencies have shorter codes. The tree could have been built in a number of ways; each would yielded different codes but the code would still be minimal. http://ecomputernotes.com

Huffman Encoding Original: traversing threaded binary trees Encoded: 001110000111001011100111010101101001011110011001111010100001001010100111110000101011000011011101111100111010110101110000 t r a v e http://ecomputernotes.com

Huffman Encoding Original: traversing threaded binary trees With 8 bits per character, length is 264. Encoded: 001110000111001011100111010101101001011110011001111010100001001010100111110000101011000011011101111100111010110101110000 Compressed into 122 bits, 54% reduction. http://ecomputernotes.com

Mathematical Properties of Binary Trees http://ecomputernotes.com

Properties of Binary Tree Property: A binary tree with N internal nodes has N+1 external nodes. http://ecomputernotes.com

Properties of Binary Tree A binary tree with N internal nodes has N+1 external nodes. D F B C G A E F E internal nodes: 9 external nodes: 10 external node internal node http://ecomputernotes.com

Properties of Binary Tree Property: A binary tree with N internal nodes has 2N links: N-1 links to internal nodes and N+1 links to external nodes. http://ecomputernotes.com

Threaded Binary Tree Property: A binary tree with N internal nodes has 2N links: N-1 links to internal nodes and N+1 links to external nodes. D F B C G A E F E Internal links: 8 External links: 10 external link internal link http://ecomputernotes.com

Properties of Binary Tree Property: A binary tree with N internal nodes has 2N links: N-1 links to internal nodes and N+1 links to external nodes. In every rooted tree, each node, except the root, has a unique parent. Every link connects a node to its parent, so there are N -1 links connecting internal nodes. Similarly, each of the N +1 external nodes has one link to its parent. Thus N -1+ N +1=2 N links. http://ecomputernotes.com

computer notes - Data Structures - 24

More Related Content

Viewers also liked (20)

Similar to computer notes - Data Structures - 24 (20)

More from ecomputernotes (18)

Recently uploaded (20)

computer notes - Data Structures - 24

Editor's Notes